Package edu.claflin.finder.algo

Class DijkstraShortestPath

java.lang.Object

edu.claflin.finder.algo.Algorithm

edu.claflin.finder.algo.DijkstraShortestPath

All Implemented Interfaces:

Processable<Graph,Graph>

public class DijkstraShortestPath
extends Algorithm

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
(package private) class	DijkstraShortestPath.EdgeComparator

Nested classes/interfaces inherited from class edu.claflin.finder.algo.Algorithm

Algorithm.GraphSortOrder

Field Summary

Fields inherited from class edu.claflin.finder.algo.Algorithm

args, counter, listener, PROP_PROGRESS

Constructor Summary

Constructors

Constructor	Description
DijkstraShortestPath(ArgumentsBundle bundle)	Public Constructor for creating an Algorithm.

Method Summary

Modifier and Type	Method	Description
private Node	closestReachableUnvisited(java.util.HashMap<Node,java.lang.Double> shortestPathMap, Graph graph, java.util.Set<java.lang.String> visited)
private double	getWeight(java.util.List<Edge> E)
java.util.ArrayList<Graph>	process(Graph graph)	Processes data.

Methods inherited from class edu.claflin.finder.algo.Algorithm

addPropertyChangeListener, cull, getGraphSortOrder, getPartiteNumber, removePropertyChangeListener, setGraphSortOrder, setPartiteNumber, setProgress

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DijkstraShortestPath

public DijkstraShortestPath(ArgumentsBundle bundle)

Public Constructor for creating an Algorithm.

Parameters:

bundle - the ArgumentsBundle containing the arguments for the Algorithm object.

Method Detail

process

public java.util.ArrayList<Graph> process(Graph graph)

Description copied from interface: Processable

Processes data.

Parameters:

graph - the T type object to process.

Returns:

the S type object array produced by the processing.

closestReachableUnvisited

private Node closestReachableUnvisited(java.util.HashMap<Node,java.lang.Double> shortestPathMap,
                                       Graph graph,
                                       java.util.Set<java.lang.String> visited)

getWeight

private double getWeight(java.util.List<Edge> E)